- acyclic priority
- acyclic priority azyklische Priorität f (Schutztechnik)
English-German dictionary of Electrical Engineering and Electronics. 2013.
English-German dictionary of Electrical Engineering and Electronics. 2013.
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
Trie — A trie for keys A , to , tea , ted , ten , i , in , and inn . In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are usually strings. Unlike a binary search… … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
organosulfur compound — ▪ chemical compound Introduction also spelled organosulphur compound , also called organic sulfur compound a subclass of organic substances that contain sulfur and that are known for their varied occurrence and unusual properties. They are… … Universalium
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
Heap (data structure) — This article is about the programming data structure. For the dynamic memory area, see Dynamic memory allocation. Example of a complete binary max heap In computer science, a heap is a specialized tree based data structure that satisfies the heap … Wikipedia
Instruction scheduling — In computer science, instruction scheduling is a compiler optimization used to improve instruction level parallelism, which improves performance on machines with instruction pipelines. Put more simply, without changing the meaning of the code, it … Wikipedia
isomerism — /uy som euh riz euhm/, n. 1. Chem. the relation of two or more compounds, radicals, or ions that are composed of the same kinds and numbers of atoms but differ from each other in structural arrangement (structural isomerism), as CH3OCH3 and… … Universalium
Alcohol — This article is about the generic chemistry term. For the kind of alcohol found in alcoholic beverages, see Ethanol. For beverages containing alcohol, see Alcoholic beverage. For other uses, see Alcohol (disambiguation) … Wikipedia